Structured Derivations as a Unified Proof Style for Teaching Mathematics
نویسنده
چکیده
Structured derivations were introduced by Back and von Wright as an extension of the calculational proof style originally proposed by E.W. Dijkstra and his colleagues. Structured derivations added nested subderivations and inherited assumptions to the original calculational style. This paper introduces a further extension of the structured derivation format, and gives a precise syntax and semantics for the extended proof style. The extension provides a unification of the tree main proof styles used in mathematics today: Hilbert-style forward chaining proofs, Gentzen-style backward chaining proofs and algebraic derivations and calculations (in particular, Dijkstra’s calculational proof style). Each of these proof styles can be directly modelled as an extended structured derivation. Even more importantly, the three proof styles can be freely intermixed in a single structured derivation, allowing different proof styles to be used in different parts of the derivation, each time choosing the proof style that is most suitable for the (sub)problem at hand. We describe here (extended) structured derivations, feature by feature, and illustrate each feature with examples. We show how to model the three main proof styles as structured derivations. We give an exact syntax for this proof style and define the semantics of structured derivations. The latter is done by showing how each structured derivation can be automatically translated into an equivalent Gentzen-style derivation. Structured derivations have been primarily developed for teaching mathematics on secondary and tertiary education level. The syntax of structured derivations determines the general structure of the proof, but does not impose any restrictions on how the basic constructs of the underlying mathematical domain are expressed. Hence, the style can be used for any kind of mathematical proofs, calculations, derivations, and general problem solving found in mathematics education at these levels. The exact syntax makes it easy to provide computer support for structured derivations.
منابع مشابه
Structured Derivations: a Method for Doing High-School Mathematics Carefully
We show how solutions to typical problems of High School and rst-year University Mathematics can be written using structured derivations. Such a derivation extends the calculational proof format with subderivations that allow inferences to presented at di erent levels of detail. They also constitute a new paradigm where the whole solution process is viewed as an object that can be discussed and...
متن کاملDoing High School Mathematics Carefully
We show how solutions to typical problems of High School and rst-year University mathematics can be written using structured derivations. Such a derivation extends the calculational proof format with subderivations that allow inferences to presented at diierent levels of detail. By using structured derivations and a minimal amount of logical syntax, we can write solution to typical problems in ...
متن کاملStructural Induction in Programming Language Semantics A Note for C S 386L Students
Programming language syntax and semantics use various structured objects. Languages and derivations (proofs) are two examples. Often, one wishes to prove that a property holds for some set of these structured objects. Typically these objects are defined recursively, so induction is a natural proof approach. Structural induction is one pattern of inductive proof. In this note, we will (1) define...
متن کاملSymbolic Computation for Electronic Publishng
Recently, we developed and reported some novel ways to make MATHEMATICA produce derivations that contain conventionally structured narratives and formulas, using a procedure that interprets files containing expressions, which MATHEMATICA evaluates symbolically, control information and text. Now, this work is extended to give TEX typeset output. It supports the interactive crafting of publicatio...
متن کاملDouble derivations of n-Lie algebras
After introducing double derivations of $n$-Lie algebra $L$ we describe the relationship between the algebra $mathcal D(L)$ of double derivations and the usual derivation Lie algebra $mathcal Der(L)$. In particular, we prove that the inner derivation algebra $ad(L)$ is an ideal of the double derivation algebra $mathcal D(L)$; we also show that if $L$ is a perfect $n$-Lie algebra wit...
متن کامل